Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
نویسندگان
چکیده
This paper describes some attacks on word-oriented stream ciphers that use a linear feedback shift register (LFSR) and a non-linear lter. These attacks rely on exploiting linear relationships corresponding to multiples of the connection polynomial that de ne the LFSR.
منابع مشابه
Powers of Subfield Polynomials and Algebraic Attacks on Word-Based Stream Ciphers
In this paper we investigate univariate algebraic attacks on filter generators over extension fields Fq = F2n with focus on the WelchGong (WG) family of stream ciphers. Our main contribution is to break WG-5, WG-7, WG-8 and WG-16 by combining results on the so-called spectral immunity (minimum distance of certain cyclic codes) with properties of the WG type stream cipher construction. The spect...
متن کاملWord-oriented Linear Feedback Shift Registers: σ−LFSRs
A new family of word-oriented linear feedback shift registers named σ−LFSRs is presented and analyzed in this paper. σ−LFSRs are constructed by few fundamental instructions so that they have high efficiency. Comparing with the theory of classical LFSRs, we research on the basic properties of σ−LFSRs, such as minimal polynomial, state graph, coordinate sequence, and the properties of primitive σ...
متن کاملPrimitive polynomials for robust linear feedback shift registers-based scramblers and stream ciphers
It is well known that in order to build linear scramblers and stream ciphers that are robust against correlation-based reconstruction, primitive polynomials which do not have sparse multiples of moderate degrees must be used. In this paper, the existence and density of such ‘good primitive polynomials’ are studied. Two theoretical lower bounds on the degree d of the primitive polynomial are der...
متن کاملStream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملAlgebraic Attacks and Decomposition of Boolean Functions
Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found. Low degree relations have been shown to exist for several well known constructions of stream ciphers immune to al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000